Prime sieves using binary quadratic forms
نویسندگان
چکیده
We introduce an algorithm that computes the prime numbers up to N using O(N/log logN) additions and N1/2+o(1) bits of memory. The algorithm enumerates representations of integers by certain binary quadratic forms. We present implementation results for this algorithm and one of the best previous algorithms.
منابع مشابه
Asymptotic formulas for partial sums of class numbers of indefinite binary quadratic forms
Sarnak obtained the asymptotic formula of the sum of the class numbers of indefinite binary quadratic forms from the prime geodesic theorem for the modular group. In the present paper, we show several asymptotic formulas of partial sums of the class numbers by using the prime geodesic theorems for the congruence subgroups of the modular group.
متن کاملRepresentation of Prime Powers by Binary Quadratic Forms
In this article, we consider the representation of prime powers by binary quadratic forms of discriminant D = −2q1 . . . qt where the product of primes q1 . . . qt ≡ 3 (mod 4), for instance if it is of special RichaudDegert type n2 ± 2 for odd n’s, n2 − 1 for even n’s. We consider all the ambiguous classes and Q( √|D0|), where D0 is the fundamental discriminant and we obtain a general criterion...
متن کاملFive peculiar theorems on simultaneous representation of primes by quadratic forms
It is a theorem of Kaplansky that a prime p ≡ 1 (mod 16) is representable by both or none of x2 + 32y2 and x2 + 64y2, whereas a prime p ≡ 9 (mod 16) is representable by exactly one of these binary quadratic forms. In this paper five similar theorems are proved. As an example, one theorem states that a prime p ≡ 1 (mod 20) is representable by both or none of x2 + 20y2 and x2 + 100y2, whereas a p...
متن کاملA Level N Reduction Theory of Indefinite Binary Quadratic Forms
In this paper we study a geometric coding algorithm for indefinite binary quadratic forms Q for the congruence subgroup Γ(N), with respect to the usual fundamental domain FN , where N is assumed prime. The cycles Q1, . . . , Qn that this algorithm produces are such that the the corresponding paths γ1, . . . , γn in the Riemann surface X0(N)(C) have a nice behaviour around the elliptic points of...
متن کاملA relation between embedding degrees and class numbers of binary quadratic forms
In this paper, we describe a relation between the embedding degree of an elliptic curve over a prime field Fp and the inertial degree of the primes above p in a certain ring class field. From this relation, we conclude that the embedding degree divides the class number of a group of binary quadratic forms of a fixed discriminant.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 73 شماره
صفحات -
تاریخ انتشار 2004